Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems
نویسندگان
چکیده
منابع مشابه
Completeness in approximation classes beyond APX
We present a reduction that allows us to establish completeness results for several approximation classes mainly beyond APX. Using it, we extend one of the basic results of S. Khanna, R. Motwani, M. Sudan, and U. Vazirani (On syntactic versus computational views of approximability, SIAM J. Comput., 28:164–191, 1998) by proving the existence of complete problems for the whole Log-APX, the class ...
متن کاملOn Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)
We investigate the approximability of minimum and maximum linear ordering problems (MIN-LOP and MAX-LOP) and related feedback set problems such as maximum weight acyclic subdiagraph (MAX-W-SUBDAG), minimum weight feedback arc/vertex set (MIN-W-FAS/ MIN-W-FVS) and a generalization of the latter called MIN-Subset-FAS/MIN-Subset-FVS. MAX-LOP and the other problems have been studied by many researc...
متن کاملApproximability of 3- and 4-Hop Bounded Disjoint Paths Problems
A path is said to be `-bounded if it contains at most ` edges. We consider two types of `-bounded disjoint paths problems. In the maximum edgeor node-disjoint path problems MEDP(`) and MNDP(`), the task is to find the maximum number of edgeor node-disjoint `-bounded (s, t)-paths in a given graph G with source s and sink t, respectively. In the weighted edgeor node-disjoint path problems WEDP(`)...
متن کاملOn the Approximability of Splitting-SAT in 2-CNF Horn Formulas
Splitting a variable in a Boolean formula means to replace an arbitrary set of its occurrences by a new variable. In the minimum splitting SAT problem, we ask for a minimum-size set of variables to be split in order to make the formula satisfiable. This problem is known to be APX-hard, even for 2-CNF formulas. We consider the case of 2CNF Horn formulas, i. e., 2-CNF formulas without positive 2-...
متن کاملThe Approximability of Three-valued MAX CSP
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 58 شماره
صفحات -
تاریخ انتشار 1996